Entropy of Subordinate Shift Spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independence entropy of Zd-shift spaces

We introduce a concept of independence entropy for symbolic dynamical systems. This notion of entropy measures the extent to which one can freely insert symbols in positions without violating the constraint defined by the shift space. We show that for a certain class of one-dimensional shift spaces X, the independence entropy coincides with the limiting, as d tends to infinity, topological entr...

متن کامل

Independence entropy of Z-shift spaces

Topological entropy is the most fundamental numerical invariant associated to a d-dimensional shift space. When d = 1 and the shift space is a shift of finite type (SFT) or sofic shift, the topological entropy is easy to compute as the log of the largest eigenvalue of a nonnegative integer matrix. However, when d = 2 there is no known explicit expression for the topological entropy of SFTs, eve...

متن کامل

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Metric Entropy of Homogeneous Spaces

For a (compact) subset K of a metric space and ε > 0, the covering number N(K, ε) is defined as the smallest number of balls of radius ε whose union covers K. Knowledge of the metric entropy, i.e., the asymptotic behaviour of covering numbers for (families of) metric spaces is important in many areas of mathematics (geometry, functional analysis, probability, coding theory, to name a few). In t...

متن کامل

Entropy of a bit-shift channel

We consider a simple transformation (coding) of an iid source called a bit-shift channel. This simple transformation occurs naturally in magnetic or optical data storage. The resulting process is not Markov of any order. We discuss methods of computing the entropy of the transformed process, and study some of its properties. Results presented in this paper originate from the discussions we had ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The American Mathematical Monthly

سال: 2018

ISSN: 0002-9890,1930-0972

DOI: 10.1080/00029890.2018.1401875